λ¬Έμ
Programmers - μΆμ νΈλν½
π Logic
private void getTime(String[] doneTime, int procTime) {
int hour = Integer.parseInt(doneTime[0]);
int min = Integer.parseInt(doneTime[1]);
int sec = (int) (Double.parseDouble(doneTime[2]) * 1000);
int endSec = hour * 1000 * 60 * 60 + min * 1000 * 60 + sec;
int startSec = endSec - procTime + 1;
times.add(new Time(startSec, endSec));
}
- λ¬Έμμ΄μ νμ±νμ¬ μ, λΆ, μ΄ λ¨μλ‘ λ³ν ν μ΄λ₯Ό μ μλ‘ λ³ν
private int findMaxRequest(int startTime) {
int count = 0;
// start ~ end μ¬μ΄μ μλ€λ©΄ count + 1;
int endTime = startTime + 1000;
for (Time time : times) {
if (startTime <= time.startSec && time.startSec < endTime) {
count++;
} else if (startTime <= time.endSec && time.endSec < endTime) {
count++;
} else if (endTime <= time.endSec && time.startSec <= startTime) {
count++;
}
}
return count;
}
-
μ£Όμ΄μ§ μκ°μ λ‘κ·Έμ μμ μκ° λλ μ’ λ£ μκ°
- ν΄λΉ μκ°μΌλ‘λΆν° 1μ΄ λ΄μ λ€λ₯Έ λ‘κ·Έκ° μ‘΄μ¬νλ€λ©΄
countλ₯Ό μ¦κ°
- ν΄λΉ μκ°μΌλ‘λΆν° 1μ΄ λ΄μ λ€λ₯Έ λ‘κ·Έκ° μ‘΄μ¬νλ€λ©΄
π CODE
μ½λ 보기/μ κΈ°π«
import java.util.*;
class Time {
int startSec;
int endSec;
public Time(int startSec, int endSec) {
this.startSec = startSec;
this.endSec = endSec;
}
}
class Solution {
ArrayList<Time> times = new ArrayList<>();
public int solution(String[] lines) {
// λ‘κ·Έ κ°μκ° 1κ°λ©΄ 무쑰건 1 λ°ν
if (lines.length == 1) return 1;
for (String line : lines) {
String[] times = line.substring(11).split(" ");
String[] doneTime = times[0].split(":");
int procTime = (int) (Double.parseDouble(times[1].replace("s", "")) * 1000);
getTime(doneTime, procTime);
}
int max = 0;
// μμμ μ΄ κ±Έμ³μλ κ²½μ°μ λμ μ΄ κ±Έμ³μλ κ²½μ°, timeμ startμ endλ₯Ό κΈ°μ μΌλ‘ 1μ΄ μμ λͺκ°μ μμ²μ΄ μ²λ¦¬λλμ§ μΉ΄μ΄νΈ
for (Time time : times)
max = Math.max(max, Math.max(findMaxRequest(time.startSec), findMaxRequest(time.endSec)));
return max;
}
// μμ μκ°κ³Ό μ’
λ£ μκ°μ ꡬν΄μ ArrayListμ μΆκ°
private void getTime(String[] doneTime, int procTime) {
int hour = Integer.parseInt(doneTime[0]);
int min = Integer.parseInt(doneTime[1]);
int sec = (int) (Double.parseDouble(doneTime[2]) * 1000);
int endSec = hour * 1000 * 60 * 60 + min * 1000 * 60 + sec;
int startSec = endSec - procTime + 1;
times.add(new Time(startSec, endSec));
}
private int findMaxRequest(int startTime) {
int count = 0;
// start ~ end μ¬μ΄μ μλ€λ©΄ count + 1;
int endTime = startTime + 1000;
for (Time time : times) {
if (startTime <= time.startSec && time.startSec < endTime) {
count++;
} else if (startTime <= time.endSec && time.endSec < endTime) {
count++;
} else if (endTime <= time.endSec && time.startSec <= startTime) {
count++;
}
}
return count;
}
}
βοΈ Review
- λ¬Έμμ΄ νμ±νλ κ³Όμ λΆν° λ§μμ λ€μ§ μμ λ¬Έμ μκ³ , μ λ§€ν μ€λͺ λλ¬Έμ μ΄ν΄κ° λ κ°μ§ μμλ€.
- μ²μμλ μ΄ λ¨μμ μ 보λ§μ κ°μ§κ³ λ¬Έμ λ₯Ό ν΄κ²°νλ €λ€κ° μμ°¨ μΆμλ€.
- λ°μ΄ν° ν λ³ν λν μ’ λ κΌΌκΌΌν νμΈνλ μ΅κ΄μ κ°μ ΈμΌκ² λ€.